Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points
نویسندگان
چکیده
منابع مشابه
Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points
Abstract. The computation of the structured pseudospectral abscissa and radius (with respect to the Frobenius norm) of a Toeplitz matrix is discussed and two algorithms based on a low rank property to construct extremal perturbations are presented. The algorithms are inspired by those considered in [GO11] for the unstructured case, but their extension to structured pseudospectra and analysis pr...
متن کاملOn the Boundary of the Pseudospectrum and Its Fault Points
The study of pseudospectra of linear transformations has become a significant part of numerical linear algebra and related areas. A large body of research activity has focused on how to compute these sets for a given spectral problem with, possibly, certain underlying structure. The theme of this paper was motivated by the question: How effective are path-following procedures for tracing the ps...
متن کاملthe survey of the virtual higher education in iran and the ways of its development and improvement
این پژوهش با هدف "بررسی وضعیت موجود آموزش عالی مجازی در ایران و راههای توسعه و ارتقای آن " و با روش توصیفی-تحلیلی و پیمایشی صورت پذیرفته است. بررسی اسنادو مدارک موجود در زمینه آموزش مجازی نشان داد تعداد دانشجویان و مقاطع تحصیلی و رشته محل های دوره های الکترونیکی چندان مطلوب نبوده و از نظر کیفی نیز وضعیت شاخص خدمات آموزشی اساتید و وضعیت شبکه اینترنت در محیط آموزش مجازی نامطلوب است.
Eigenvalues, Pseudospectrum and Structured Perturbations
We investigate the behavior of eigenvalues under structured perturbations. We show that for many common structures such as (complex) symmetric, Toeplitz, symmetric Toeplitz, circulant and others the structured condition number is equal to the unstructured condition number for normwise perturbations, and prove similar results for real perturbations. An exception are complex skewsymmetric matrice...
متن کاملCobra: Parallel path following for computing the matrix pseudospectrum
The construction of an accurate approximation of the-pseudospectrum of a matrix by means of the standard grid method is a very demanding computational task. In this paper, we describe Cobra, a domain-based method for the computation of pseudospectra that combines predictor corrector path following with a one-dimensional grid. The algorithm oers large and medium grain parallelism and becomes pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2012
ISSN: 0895-4798,1095-7162
DOI: 10.1137/120864349